resource allocation in multi-server dynamic pert networks using multi-objective programming and markov process

Authors

m. bagherpour

abstract

in this research, both resource allocation and reactive resource allocation problems in multi-server dynamic pert networks are analytically modeled, where new projects are expected to arrive according to a poisson process, and activity durations are also known as independent random variables with exponential distributions. such system is represented as a queuing network, where multi servers at each service station are allocated, and also each activity of a project is operated at a devoted service station with only one server located at a node of the network based on first come first serve (fcfs) policy. in order to propose a novel approach for modeling of multi-server dynamic pert network, initially the network of queues is transformed into a stochastic network. then, a differential equations system is organized to solve and obtain approximate completion time distribution for any particular project by applying an appropriate finite-state continuous-time markov model. finally, a multi-objective model including four conflicted objectives is presented to optimally control the resources allocated to the service stations in a multi-server dynamic pert network, and the goal attainment method is further employed to solve a discretetime approximation of the primary multi-objective problem.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Resource allocation in multi-server dynamic PERT networks using multi-objective programming and Markov process

In this research, both resource allocation and reactive resource allocation problems in multi-server dynamic PERT networks are analytically modeled, where new projects are expected to arrive according to a Poisson process, and activity durations are also known as independent random variables with exponential distributions. Such system is represented as a queuing network, where multi servers at ...

full text

A multi-objective resource allocation problem in dynamic PERT networks

We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and the new projects are generated according to a Poisson process. This dynamic PERT network is represented as a network of queues, where the service times represent the durations of the corresponding activities and the arr...

full text

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

full text

A multi-objective resource allocation problem in PERT networks

We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each activity is a non-increasing function and the direct cost of each activity is a non-decreasing function of the amount of resource allocated to it. The decision variables of the model are the allocated resource quantities...

full text

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

full text

a multi objective fibonacci search based algorithm for resource allocation in pert networks

the problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. we seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. we assume that the work content required by the activities follows an exponential distribution. the decision variables of the model are the allocated resourc...

full text

My Resources

Save resource for easier access later


Journal title:
iranian journal of science and technology (sciences)

ISSN 1028-6276

volume 35

issue 2 2011

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023